搜索资源列表
HJ搜索
- 用于Hooke—Jeeve模式搜索算法，完成多变量的寻优。多变量搜索中直接搜索算法的一种。-for Hooke-mode Jeeves search algorithm, complete multivariate optimization. Multivariable direct search of a search algorithm.
hooke-jeeves直接搜索法
- 优化算法中hooke-jeeves直接搜索法
求解药代动力学参数的混合人口迁移算法
- 摘要：针对传统方法优化药代动力学参数时精度不高的缺陷，将Hooke-Jeeves 算法与人口迁移算法有机融 合，使两者取长补短，既提高了算法的精度，又加快了算法的收敛速度。将混合人口迁移算法用于血管外给药 二室模型参数优化的实验之中，不仅比传统的残数法效果要好，而且比Hooke-Jeeves 算法或人口迁移算法更 优，精度更高。多次实验表明：算法具有良好的可靠性和稳定性，是一种较好的解决药代动力学参数的方法。
Hooke-Jeeves
- 用Matlab编写的用Hooke-Jeeves方法求函数极小点程序-Written with Matlab using Hooke-Jeeves method of procedure demand function minimizer
hooke
- hooke算法的自我编写的小小的程序能够用来计算问题的最优值-hooke
cultural
- 文化算法的MATLAB实现。实验结果表明该算法具有良好的性能。-MATLAB implementation of cultural algorithms. Experimental results show that the algorithm has good performance.
hooke-jeeves
- 优化算法中直接搜索法，Hooke-Jeeves算法-Direct search optimization method, Hooke-Jeeves Algorithm
Tahvil
- Hooke And Jeeves Using Line Searches nonlinear optimization
hooke-jeeves_C
- hooke-jeeves的学习代码 c编写-hooke-jeeves learning code c to write
hkjvs
- Hooke and Jeeves search optimization fortran solution
hookeandjeeves
- Hooke and Jeeves Search Method Matlab m file
hkjeeves
- Hooke-Jeeves Directional Search Method
optimization
- many optimization methods(BFGS Method / Golden section search method / Hooke & Jeeves direct search method / Simplex method)
HookeJeeves
- Method of hooke and jeeves and the golden section in SCILAB for function 2d
Hooke-and-Jeeves
- A simple optimization algorithm example :Hooke and Jeeves method
hooke
- hooke-jeeves模式搜索法具有很好的求解最优解的功能,本算法是Mark G. Johnson 编写的，大家可以参考学习-Nonlinear Optimization using the algorithm of Hooke and Jeeves
Hooke-Jeeves
- Hook & Jeeves method implemented by matlab
Hooke
- The elapsed time of Nelder and Mead simplex method seems to be larger than Hooke and Jeeves method but, it reached the solution in just 2 iterations which is remarkably less than the previous method. From Tables 1 and 2 it can be said that the optimi
trans_f
- By comparing elapsed times one can say that Hooke and Jeeves methods converge faster than other methods and the slowest one seems to be Nelder and Mead Simplex Method. In this part of the assignment we are going to reach the solution by using Nelde